Crystal and Molecular Structure of N,N'-Diethyl-N,N'-Diphenylurea
نویسندگان
چکیده
منابع مشابه
Gauge - invariant formulation of NN → NN γ
H. Haberzettl1,* and K. Nakayama2,3,† 1Institute for Nuclear Studies and Department of Physics, The George Washington University, Washington, DC 20052, USA 2Department of Physics and Astronomy, University of Georgia, Athens, GA 30602, USA 3Institut für Kernphysik and Jülich Center for Hadron Physics, Forschungszentrum Jülich, 52425 Jülich, Germany (Received 8 November 2010; revised manuscript r...
متن کاملQTAIM study of Bonding and Structure of Pure Atomic Clusters,Part III : Nn Clusters (n= 4,6)
DFT and QTAIM computations have been performed on numbers of pure nitrogen cluster speciesi.e. Nn (n = 4, 6) for investigating the structure and bonding. This study is critical since thesemolecules have been nominated as the good synthetic targets of High Energy Materials (HEM).0nthe other hand the decomposition mechanism is closely depends on the bonding pattern. Thislatter concept was searche...
متن کاملNuclear Structure and Response based on Correlated Realistic NN Interactions
Starting from the Argonne V18 nucleon-nucleon interaction and using the Unitary Correlation Operator Method, a correlated interaction vUCOM has been constructed, which is suitable for calculations within restricted Hilbert spaces. In this work we employ the vUCOM in Hartree-Fock, perturbation-theory and RPA calculations and we study the ground-state properties of various closed-shell nuclei, as...
متن کاملFrom the NN Interaction to Nuclear Structure and Reactions
Abstract. We present a novel approach for the treatment of realistic nucleonnucleon interactions in nuclear many-body systems. A unitary correlation operator is used to explicitly introduce short-range central and tensor correlations in many-body states. The resulting correlated interaction serves as an effective interaction in nuclear structure calculations. Results for Lithium isotopes includ...
متن کاملFast k-NN search
Random projection trees have proven to be effective for approximate nearest neighbor searches in high dimensional spaces where conventional methods are not applicable due to excessive usage of memory and computational time. We show that building multiple trees on the same data can improve the performance even further, without significantly increasing the total computational cost of queries when...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 1970
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.67.1.426